全文获取类型
收费全文 | 80976篇 |
免费 | 470篇 |
国内免费 | 390篇 |
专业分类
化学 | 26721篇 |
晶体学 | 812篇 |
力学 | 6743篇 |
数学 | 32125篇 |
物理学 | 15435篇 |
出版年
2020年 | 39篇 |
2019年 | 51篇 |
2018年 | 10456篇 |
2017年 | 10291篇 |
2016年 | 6114篇 |
2015年 | 910篇 |
2014年 | 368篇 |
2013年 | 492篇 |
2012年 | 3943篇 |
2011年 | 10690篇 |
2010年 | 5742篇 |
2009年 | 6160篇 |
2008年 | 6811篇 |
2007年 | 8965篇 |
2006年 | 414篇 |
2005年 | 1508篇 |
2004年 | 1678篇 |
2003年 | 2105篇 |
2002年 | 1104篇 |
2001年 | 274篇 |
2000年 | 321篇 |
1999年 | 166篇 |
1998年 | 208篇 |
1997年 | 175篇 |
1996年 | 220篇 |
1995年 | 143篇 |
1994年 | 101篇 |
1993年 | 128篇 |
1992年 | 74篇 |
1991年 | 91篇 |
1990年 | 79篇 |
1989年 | 84篇 |
1988年 | 84篇 |
1987年 | 82篇 |
1986年 | 73篇 |
1985年 | 99篇 |
1984年 | 84篇 |
1983年 | 51篇 |
1982年 | 71篇 |
1981年 | 75篇 |
1980年 | 78篇 |
1979年 | 89篇 |
1978年 | 62篇 |
1977年 | 44篇 |
1976年 | 39篇 |
1914年 | 45篇 |
1913年 | 40篇 |
1912年 | 40篇 |
1909年 | 41篇 |
1908年 | 40篇 |
排序方式: 共有10000条查询结果,搜索用时 46 毫秒
991.
Optimization Implementation and Characterization of the Equal Allocation of Nonseparable Costs Value
Panfei Sun Dongshuang Hou Hao Sun Theo Driessen 《Journal of Optimization Theory and Applications》2017,173(1):336-352
This paper devotes to the study of the equal allocation of nonseparable costs value for cooperative games. On the one hand, we show that the equal allocation of nonseparable costs value is the unique optimal solution that minimizes the total complaints for individual players over the pre-imputation set. On the other hand, analogously to the way of determining the Nucleolus, we obtain the equal allocation of nonseparable costs value by applying the lexicographic order over the individual complaints. Moreover, we offer alternative characterizations of the equal allocation of nonseparable costs value by proposing several new properties such as dual nullifying player property, dual dummifying player property and grand marginal contribution monotonicity. 相似文献
992.
Le Quang Thuy Bui Thi Thanh Nguyen Thi Toan 《Journal of Optimization Theory and Applications》2017,173(2):421-442
Motivated by our recent works on optimality conditions in discrete optimal control problems under a nonconvex cost function, in this paper, we study second-order necessary and sufficient optimality conditions for a discrete optimal control problem with a nonconvex cost function and state-control constraints. By establishing an abstract result on second-order optimality conditions for a mathematical programming problem, we derive second-order necessary and sufficient optimality conditions for a discrete optimal control problem. Using a common critical cone for both the second-order necessary and sufficient optimality conditions, we obtain “no-gap” between second-order optimality conditions. 相似文献
993.
Abadie Constraint Qualifications for Convex Constraint Systems and Applications to Calmness Property
In this paper, we mainly study concepts of Abadie constraint qualification and strong Abadie constraint qualification for a convex constraint system defined by a closed convex multifunction and a closed convex subset. These concepts can cover Abadie constraint qualifications for the feasible region of convex optimization problem and the convex multifunction. Several characterizations for these Abadie constraint qualifications are also provided. As applications, we use these Abadie constraint qualifications to characterize calmness properties of the convex constraint system. 相似文献
994.
Vu Thi Huong Jen-Chih Yao Nguyen Dong Yen 《Journal of Optimization Theory and Applications》2017,174(2):567-612
We present a continuous-time generalization of the seminal research and development model of d’Aspremont and Jacquemin (Am Econ Rev 78(5):1133–1137, 1988) to examine the trade-off between the benefits of allowing firms to cooperate in research and the corresponding increased potential for product market collusion. We show the existence of a solution to the optimal investment problem using a combination of results from viscosity theory and the theory of planar dynamical systems. In particular, we show that there is a critical level of marginal cost at which firms are indifferent between doing nothing and starting to develop the technology. We find that colluding firms develop further a wider range of initial technologies, pursue innovations more quickly, and are less likely to abandon a technology. Product market collusion could thus yield higher total surplus. 相似文献
995.
Javier Cano Javier M. Moguerza Francisco J. Prieto 《Journal of Optimization Theory and Applications》2017,174(2):474-499
In this work, we describe the efficient use of improved directions of negative curvature for the solution of bound-constrained nonconvex problems. We follow an interior-point framework, in which the key point is the inclusion of computational low-cost procedures to improve directions of negative curvature obtained from a factorisation of the KKT matrix. From a theoretical point of view, it is well known that these directions ensure convergence to second-order KKT points. As a novelty, we consider the convergence rate of the algorithm with exploitation of negative curvature information. Finally, we test the performance of our proposal on both CUTEr/st and simulated problems, showing empirically that the enhanced directions affect positively the practical performance of the procedure. 相似文献
996.
Olivier Menoukeu Pamen 《Journal of Optimization Theory and Applications》2017,175(2):373-410
This paper presents three versions of maximum principle for a stochastic optimal control problem of Markov regime-switching forward–backward stochastic differential equations with jumps. First, a general sufficient maximum principle for optimal control for a system, driven by a Markov regime-switching forward–backward jump–diffusion model, is developed. In the regime-switching case, it might happen that the associated Hamiltonian is not concave and hence the classical maximum principle cannot be applied. Hence, an equivalent type maximum principle is introduced and proved. In view of solving an optimal control problem when the Hamiltonian is not concave, we use a third approach based on Malliavin calculus to derive a general stochastic maximum principle. This approach also enables us to derive an explicit solution of a control problem when the concavity assumption is not satisfied. In addition, the framework we propose allows us to apply our results to solve a recursive utility maximization problem. 相似文献
997.
Carolin Torchiani Jan Ohst David Willems Stefan Ruzika 《Journal of Optimization Theory and Applications》2017,174(3):858-874
This paper is concerned with a biobjective routing problem, called the shortest path with shortest detour problem, in which the length of a route is minimized as one criterion and, as second, the maximal length of a detour route if the chosen route is blocked is minimized. Furthermore, the relation to robust optimization is pointed out, and we present a new polynomial time algorithm, which computes a minimal complete set of efficient paths for the shortest path with shortest detour problem. Moreover, we show that the number of nondominated points is bounded by the number of arcs in the graph. 相似文献
998.
René Sitters 《Mathematical Programming》2017,161(1-2):135-158
We show that minimizing the average job completion time on unrelated machines is \(\mathcal {APX}\)-hard if preemption of jobs is allowed. This provides one of the last missing pieces in the complexity classification of machine scheduling with (weighted) sum of completion times objective. The proof is based on a mixed integer linear program. This means that verification of the reduction is partly done by an ILP-solver. This gives a concise proof which is easy to verify. In addition, we give a deterministic 1.698-approximation algorithm for the weighted version of the problem. The improvement is made by modifying and combining known algorithms and by the use of new lower bounds. These results improve on the known \(\mathcal {NP}\)-hardness and 2-approximability. 相似文献
999.
Frank E. Curtis Nicholas I. M. Gould Daniel P. Robinson Philippe L. Toint 《Mathematical Programming》2017,161(1-2):73-134
We present an interior-point trust-funnel algorithm for solving large-scale nonlinear optimization problems. The method is based on an approach proposed by Gould and Toint (Math Prog 122(1):155–196, 2010) that focused on solving equality constrained problems. Our method is similar in that it achieves global convergence guarantees by combining a trust-region methodology with a funnel mechanism, but has the additional capability of being able to solve problems with both equality and inequality constraints. The prominent features of our algorithm are that (i) the subproblems that define each search direction may be solved with matrix-free methods so that derivative matrices need not be formed or factorized so long as matrix-vector products with them can be performed; (ii) the subproblems may be solved approximately in all iterations; (iii) in certain situations, the computed search directions represent inexact sequential quadratic optimization steps, which may be desirable for fast local convergence; (iv) criticality measures for feasibility and optimality aid in determining whether only a subset of computations need to be performed during a given iteration; and (v) no merit function or filter is needed to ensure global convergence. 相似文献
1000.
Jean-Pierre Crouzeix Nadezda Sukhorukova Julien Ugon 《Journal of Optimization Theory and Applications》2017,172(3):950-964
In this paper, we derive a necessary condition for a best approximation by piecewise polynomial functions of varying degree from one interval to another. Based on these results, we obtain a characterization theorem for the polynomial splines with fixed tails, that is the value of the spline is fixed in one or more knots (external or internal). We apply nonsmooth nonconvex analysis to obtain this result, which is also a necessary and sufficient condition for inf-stationarity in the sense of Demyanov–Rubinov. This paper is an extension of a paper where similar conditions were obtained for free tails splines. The main results of this paper are essential for the development of a Remez-type algorithm for free knot spline approximation. 相似文献